Linear orders: When embeddability and epimorphism agree

When Grammar and Parsing Agree

Theoretical and experimental research on language has nowadays reached an extraordinary level of complexity. Generative linguistics has produced detailed maps of syntactic structures and computations that have significantly contributed to our knowledge of language architecture as an abstract system (Rizzi, 2012; Everaert et al., 2015). Psycho-/neurolinguistics has developed complex experimental...

Universality of Embeddability Relations for Coloured Total Orders

Some examples of Σ 1 1-universal preorders are presented, in the form of various relations of embeddability between countable coloured total orders. As an application, strengthening a theorem of [7], the Σ 1 1-universality of continuous embeddability for dendrites whose branch points have order 3 is obtained.

Developed smectics: when exact solutions agree.

In the limit where the bending modulus vanishes, we construct layer configurations with arbitrary dislocation textures by exploiting a connection between uniformly spaced layers in two dimensions and developable surfaces in three dimensions. We then show how these focal textures can be used to construct layer configurations with finite bending modulus.

Extending Partial Orders to Dense Linear Orders

Cofinalities of Linear Orders